Resolution Search and Dynamic Branch-and-Bound

A novel approach to pure 0-1 integer programming problems called Resolution Search has been proposed by Chvatal (l997) as an alternative to implicit enumeration, with a demonstration that the method can yield more effective branching strategies. We show that an earlier method called Dynamic Branch-and-Bound (DB&B), due to Glover and Tangedahl (1976), yields the same branching strategies as Resolution Search, and other strategic alternatives in addition. Moreover, Dynamic B&B is not restricted to pure 0-1 problems, but applies to general mixed integer programs containing both general integer and continuous variables. We provide examples comparing Resolution Search to enhanced variants. We also show the relation of these approaches to Dynamic B&B, suggesting the value of further study of this neglected approach.